A Typed Lambda Calculus with Categorical Type Constructors
نویسنده
چکیده
A typed lambda calculus with categorical type constructors is introduced. It has a uniform category theoretic mechanism to declare new types. Its type structure includes categorical objects like products and coproducts as well as recursive types like natural numbers and lists. It also allows duals of recursive types, i.e. lazy types, like infinite lists. It has generalized iterators for recursive types and duals of iterators for lazy types. We will give reduction rules for this simply typed lambda calculus and show that they are strongly normalizing even though it has infinite things like infinite lists.
منابع مشابه
Third-Order Matching in the Presence of Type Constructors
We show that it is decidable whether a third order matching problem in an extension of the simply typed lambda calculus with type constructors has a solution or not We present an algorithm which given such a problem returns a solution for this problem if the problem has a solution and returns fail otherwise We also show that it is undecidable whether a third order matching problem in has a clos...
متن کاملA Termination Proof of Reduction in a Simply Typed Calculus with Constructors
The well-known proof of termination of reduction in simply typed calculi is adapted to a monomorphically typed lambda-calculus with case and constructors and recursive data types. The proof differs at several places from the standard proof. Perhaps it is useful and can be extended also to more complex calculi
متن کاملDecomposing Typed Lambda Calculus into a Couple of Categorical Programming Languages
We give two categorical programming languages with variable arrows and associated abstraction/reduction mechanisms, which extend the possibility of categorical programming Hag87, CF92] in practice. These languages are complementary to each other { one of them provides a rst-order programming style whereas the other does higher-order { and are \children" of the simply typed lambda calculus in th...
متن کاملSome Lambda Calculi with Categorial Sums and Products
We consider the simply typed-calculus with primitive re-cursion operators and types corresponding to categorical products and coproducts.. The standard equations corresponding to extensionality and to surjectivity of pairing and its dual are oriented as expansion rules. Strong normalization and ground (base-type) connuence is proved for the full calculus; full connuence is proved for the calcul...
متن کاملA Categorical Model for the Lambda Calculus with Constructors
The lambda calculus with constructors is an extension of the lambda calculus with variadic constructors. It decomposes the pattern-matching à la ML into a case analysis on constants and a commutation rule between case and application constructs. Although this commutation rule does not match with the usual computing intuitions, it makes the calculus expressive and confluent, with a rather simple...
متن کامل